a memetic algorithm for designing a capacitated hub network under demand uncertainty and disruption

Authors

احسان نیک بخش

دانشجوی دکترای مهندسی صنایع- دانشکده فنی و مهندسی- دانشگاه تربیت مدرس سید حسام الدین ذگردی

دانشیار مهندسی صنایع- بخش مهندسی صنایع- دانشکده فنی و مهندسی- دانشگاه تربیت مدرس

abstract

hub location problems are among the extensions ofclassical location problems that have numerous applications in designingtransportation, postal, and telecommunication networks. despite the evidentattention of researchers to these problems, there are few studies on designinghub networks under uncertainty and disruption. in this study, the capacitatedsingle allocation hub location problem under demand uncertainty and disruptionis investigated. first, a mathematical model based on budget of uncertaintyconcept is proposed, then a hybrid solution method based on genetic algorithmand variable neighborhood search is proposed. computational experimentsdemonstrate the accuracy of the proposed solution method in solving the testinstances. in addition, the results obtained from conducting monte-carlosimulation experiments to analyze the effects of uncertainty on the performanceof different hub network configurations show the necessity of consideringdemand uncertainty and disruption while designing hub networks.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Benders Decomposition Algorithm for Competitive Supply Chain Network Design under Risk of Disruption and Uncertainty

In this paper, bi-level programming is proposed for designing a competitive supply chain network. A two-stage stochastic programming approach has been developed for a multi-product supply chain comprising a capacitated supplier, several distribution centers, retailers and some resellers in the market. The proposed model considers demand’s uncertainty and disruption in distribution centers and t...

full text

A Hybrid Solution Method for Hub-and-Spoke Network Design under Uncertainty

Supply chain is an integrated system of facilities and activities. Gaining the optimum design of demand satisfaction network is one of the most important live issues in the decision making problems category. Most of previous studies considered unreal assumptions such as the lack of capacity constraints to satisfy demand in the network and in hubs. By considering the nature of the case that have...

full text

A multi-period distribution network design model under demand uncertainty

Supply chain management is taken into account as an inseparable component in satisfying customers' requirements. This paper deals with the distribution network design (DND) problem which is a critical issue in achieving supply chain accomplishments. A capable DND can guarantee the success of the entire network performance. However, there are many factors that can cause fluctuations in input dat...

full text

Design of a Bi-Objective Capacitated Single-Allocation Incomplete Hub Network Considering an Elastic Demand

This paper presents a bi-objective capacitated hub arc location problem with single assignment for designing a metro network with an elastic demand. In the literature, it is widely supposed that the network created with the hub nodes is complete. In this paper, this assumption is relaxed. Moreover, in most hub location problems, the demand is assumed to be static and independent of the location...

full text

A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design

The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...

full text

A Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem

In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...

full text

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023